Random sets which invariably generate the symmetric group
نویسندگان
چکیده
منابع مشابه
Sets of permutations that generate the symmetric group pairwise
The paper contains proofs of the following results. For all sufficiently large odd integers n, there exists a set of 2n−1 permutations that pairwise generate the symmetric group Sn. There is no set of 2n−1 + 1 permutations having this property. For all sufficiently large integers n with n≡ 2 mod 4, there exists a set of 2n−2 even permutations that pairwise generate the alternating group An. The...
متن کاملBLT-sets admitting the symmetric group S4
We describe a set of subgroups isomorphic to S4 in PΓO(5, q), q ≡ 5(6), and prove that they belong to exactly two different conjugacy classes. As an application we use a representative group in each of the conjugacy classes to construct a number of BLT-sets of Q(4, q), some of which were previously found by computer in [5] (see also [4]), others of which are new.
متن کاملFamilies of Vector Fields which Generate the Group of Diffeomorphisms
Given a compact manifold M , we prove that any bracket generating and invariant under multiplication on smooth functions family of vector fields on M generates the connected component of unit of the group DiffM . Let M be a smooth n-dimensional compact manifold, VecM the space of smooth vector fields on M and Diff0M the group of isotopic to the identity diffeomorphisms of M . Given f ∈ VecM , w...
متن کاملThe symmetric monoidal closed category of cpo $M$-sets
In this paper, we show that the category of directed complete posets with bottom elements (cpos) endowed with an action of a monoid $M$ on them forms a monoidal category. It is also proved that this category is symmetric closed.
متن کاملSets of elements that pairwise generate a linear group
Let G be any of the groups (P )GL(n, q), (P )SL(n, q). Define a (simple) graph Γ = Γ(G) on the set of elements of G by connecting two vertices by an edge if and only if they generate G. We prove that if the dimension n is at least 12 and not congruent to 2 modulo 4, then the maximum size of a complete subgraph in Γ is equal to the chromatic number of Γ. This work was motivated by a question of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1992
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)90129-4